Community identification in networks with unbalanced structure
نویسندگان
چکیده
منابع مشابه
Identification of community structure in networks with convex optimization
We reformulate the problem of modularity maximization over the set of partitions of a network as a conic optimization problem over the completely positive cone, converting it from a combinatorial optimization problem to a convex continuous one. A semidefinite relaxation of this conic program then allows to compute upper bounds on the maximum modularity of the network. Based on the solution of t...
متن کاملOptimal ranking in networks with community structure
The World-Wide Web (WWW) with its enormous size (~ 10 webpages) presents a challenge for efficient information retrieval and ranking. By effectively utilizing the topological information to rank the webpages, Google became the most popular tool on the web. One important feature of the WWW is that it exhibits a strong community structure in which groups of webpages (e.g. those devoted to a commo...
متن کاملCommunity Extraction in Multilayer Networks with Heterogeneous Community Structure
Multilayer networks are a useful way to capture and model multiple, binary relationships among a fixed group of objects. While community detection has proven to be a useful exploratory technique for the analysis of single-layer networks, the development of community detection methods for multilayer networks is still in its infancy. We propose and investigate a procedure, called Multilayer Extra...
متن کاملCommunity structure identification
We review and compare recent approaches to community structure identification. Definitions of communities are revisited, as well as the recently proposed modularity measure. We then classify the various methods into link removal methods, agglomerative methods, methods based on optimising the modularity measure, spectral methods and others. Finally, the performance of the methods, as applied to ...
متن کاملComparing community structure identification
We compare recent approaches to community structure identification in terms of sensitivity and computational cost. The recently proposed modularity measure is revisited and the performance of the methods as applied to ad hoc networks with known community structure, is compared. We find that the most accurate methods tend to be more computationally expensive, and that both aspects need to be con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2012
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.85.066114